Edge dominating set and colorings on graphs with fixed clique-width
نویسندگان
چکیده
منابع مشابه
On the complexity of fixed parameter clique and dominating set
We provide simple, faster algorithms for the detection of cliques and dominating sets of fixed order. Our algorithms are based on reductions to rectangular matrix multiplication. We also describe an improved algorithm for diamonds detection.
متن کاملParameterized Edge Dominating Set in Cubic Graphs
In this paper, we present an improved algorithm to decide whether a graph of maximum degree 3 has an edge dominating set of size k or not, which is based on enumerating vertex covers. We first enumerate vertex covers of size at most 2k and then construct an edge dominating set based on each vertex cover to find a satisfied edge dominating set. To enumerate vertex covers, we use a branch-and-red...
متن کاملClique-width and edge contraction
We prove that edge contractions do not preserve the property that a set of graphs has bounded clique-width.
متن کاملDominating Set on Bipartite Graphs
Finding a dominating set of minimum cardinality is an NP-hard graph problem, even when the graph is bipartite. In this paper we are interested in solving the problem on graphs having a large independent set. Given a graph G with an independent set of size z, we show that the problem can be solved in time O∗(2n−z), where n is the number of vertices of G. As a consequence, our algorithm is able t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00198-1